Infomix Infomix: Boosting the Information Integration Infomix Infomix: Boosting the Information Integration Infomix Infomix: Boosting the Information Integration
نویسندگان
چکیده
This report provides the formal definition of the query language of the INFOMIX system. The query language of the INFOMIX system will be formally defined. The language is to be fully declarative, highly expressive, and able to deal with semi-structured data to some extent.
منابع مشابه
Data Integration: a Challenging ASP Application
The paper presents INFOMIX a successful application of ASP technology to the domain of Data Integration. INFOMIX is a novel system which supports powerful information integration, utilizing the ASP system DLV. While INFOMIX is based on solid theoretical foundations, it is a user-friendly system, endowed with graphical user interfaces for the average database user and administrator, respectively...
متن کاملSystem Description: DLV with Aggregates
DLV is an efficient Answer Set Programming (ASP) system implementing the (consistent) answer set semantics [GL91] with various language extensions like weak constraints [BLR00], queries, and built-in predicates. A strong point of DLV is the high expressiveness of its language, which is able to express very complex problems, even problems which are hard for the complexity class . The language of...
متن کاملMagic Sets and Their Application to Data Integration
We propose a generalization of the well-known Magic Sets technique to Datalog¬ programs with (possibly unstratified) negation under stable model semantics. Our technique produces a new program whose evaluation is generally more efficient (due to a smaller instantiation), while preserving soundness under cautious reasoning. Importantly, if the original program is consistent, then full query-equi...
متن کاملAnswer Set Programming with Templates
The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and to deal with compound data structures. We show how ASP can be extended with ‘template’ predicate’s definitions by introducing a wellsuited form of second order logics. We present language syntax and give its operational semantics. We show that the theory supporting o...
متن کاملNon-ground Answer Set Programming
We present new complexity results on answer set checking for non-ground programs under a variety of syntactic restrictions. For several of these problems, the kind of representation of the answer set to be checked is important. In particular, we consider setbased and bitmap-based representations, which are popular in implementations of Answer Set Programming systems. Furthermore, we present new...
متن کامل